Negation can be exponentially powerful

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilinearity Can Be Exponentially Restrictive (preliminary Version)

We deene a Boolean circuit to be multilinear if the formal polynomial associated with it is multilinear as well. We consider the problem of computing the connectiv-ity function using circuits that are monotone and multilinear. Our main result is that monotone multilinear circuits for this function require exponential size. Since connectivity can be computed by monotone Boolean circuits within s...

متن کامل

Planning with Abstraction Hierarchies can be Exponentially Less Efficient

It is well-known that state abstraction can speed up planning exponentially, under ideal condi tions We add to the knowledge—showing that state abstraction may likewise slow down planning exponentially, and even result in generat ing an exponentially longer solution than necessary This phenomenon can occur for abstraction hierarchies which are generated automatically by the A L P I N E and H I ...

متن کامل

Planning with Abstraction Hierarchies Can Be Exponentially Less Eecient

It is well-known that state abstraction can speed up planning exponentially, under ideal conditions. We add to the knowledge|showing that state abstraction may likewise slow down planning exponentially, and even result in generating an exponentially longer solution than necessary. This phenomenon can occur for abstraction hierarchies which are generated automatically by the Alpine and Highpoint...

متن کامل

Classical Negation can be Expressed by One of its Halves

We present the logic K/2 which is a logic with classical implication and only the left part of classical negation. We show that it is possible to define a classical negation into K/2 and that the classical propositional logic K can be translated into this apparently weaker logic. We use concepts from model-theory in order to characterized rigorously this translation and to understand this parad...

متن کامل

Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC

We demonstrate that in the context of statically-typed purely-functional lambda calculi without recursion, unchecked exceptions (e.g., SML exceptions) can be strictly more powerful than call/cc. More precisely, we prove that a natural extension of the simply-typed lambda calculus with unchecked exceptions is strictly more powerful than all known sound extensions of Girard’s Fω (a superset of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1980

ISSN: 0304-3975

DOI: 10.1016/0304-3975(80)90060-2